Hypergraph Grammars for Knowledge Based Model Construction
نویسنده
چکیده
Graphical belief networks, including Bayes nets and influence diagrams, can be represented with directed hypergraphs. Each directed hyperedge corresponds to a factor of the joint distribution of all variables in the model. A hyperedge replacement grammar is a collection of rules for replacing hyperedges with hypergraphs. A hyperedge replacement grammar for graphical belief networks defines a collection of graphical belief models. Hyperedge replacement grammars have several interesting implications in the construction of graphical models. (1) They provide a way to represent the process of constructing a graphical model. (2) Coupled with an object-oriented variable type system, provide a convenient method for searching through candidate factors to fill a particular slot in the model graph. (3) They provide a method for integrating high-level and detailed views of a graphical model. (4) They provide a mechanism for representing uncertainty about the model structure.
منابع مشابه
Contextual Hypergraph Grammars - A New Approach to the Generation of Hypergraph Languages
In this paper, we introduce contextual hypergraph grammars, which generalize the total contextual string grammars. We study the position of the class of languages generated by contextual hypergraph grammars in comparison with graph languages generated by hyperedge replacement grammars and double-pushout hypergraph grammars. Moreover, several examples show the potential of the new class of gramm...
متن کاملA Comparison of Boundary Graph Grammars and Context-Free Hypergraph Grammars
Context-free hypergraph grammars and boundary graph grammars of bounded nonterminal degree have the same power, both for generating sets of graphs and for generating sets of hypergraphs. Arbitrary boundary graph grammars have more graph generating power than context-free hypergraph grammars, but they have the same hypergraph generating power. To obtain these results, several normal forms for bo...
متن کاملAttributed Context-Free Hypergraph Grammars
The concept of context-free hypergraph grammars (cfhg grammars) has been studied extensively over the past decade. In this paper we introduce attributed context-free hypergraph grammars (acfhg grammars) as an extension of cfhg grammars. An acfhg grammar consists of an underlying context-free hypergraph grammar G 0 and an attribution which associates attributes with the nonterminal symbols of G ...
متن کاملAccelerated Bayesian Optimization Algorithms for Advanced Hypergraph Partitioning
The paper summarizes our recent work on the design, analysis and applications of the Bayesian optimization algorithm (BOA) and its advanced accelerated variants for solving complex – sometimes NPcomplete – combinatorial optimization problems from circuit design. We review the methods for accelerating BOA for hypergraph-partitioning problem. The first method accelerates the convergence of sequen...
متن کاملAbout Graph and Hypergraph Context Free Grammars
The main idea of this paper is to show some important differences between graph grammars and hypergraph grammars in context of freeness. On the other hand, we give a possibility to transform the planar structure of a hypergraph into a linear one with concern of determinism. This can create a path to transform a pushdown automaton into a generative grammar equivalent. Key-Words: Hyperedge Replac...
متن کامل